﻿/************************************************************************
 * AIDE - Automata Identification Engine
 * Copyright (C) 2012-2013 Ali Khalili (khalili_DOT_ir_@SIGN_gmail_DOT_com)
 * **********************************************************************
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License (LGPL) published 
 * by the Free Software Foundation; either version 2.1 of the License, or (at your
 * option) any later version. This program is distributed without any
 * warranty. See the GNU Lesser General Public License for more details. 
 * ***********************************************************************
 * File         :     AIDE\Oracles\DFAs\IOracle_MAT_DFA.cs
 * Description  :     Provides "IOracle_MAT_DFA". Interface for an oracle of a DFA in MAT setting
 * Change log   :     -8 Feb 2013:  First version
 * To Do        :
 ************************************************************************/

using System;
using SMLib.Automata.Base;
using SMLib.Automata.DFA;

/// <summary>
/// Oracles for learning regular languages
/// </summary>
namespace AIDE.Oracles.DFAs
{
    /// <summary>
    /// Interface for an oracle of a DFA in MAT setting
    /// </summary>
    public interface IOracle_MAT_DFA
    {
        /// <summary>
        /// Membership Query: is a given input accepted or not
        /// </summary>
        /// <param name="word">input word</param>
        /// <returns>true if it is accepting, false in other case</returns>
        bool MembershipQuery(Word word);

        /// <summary>
        /// Equivalence Query: find the counterexample for a given conjecture
        /// </summary>
        /// <param name="conjucture">the bulit conjecture to be compared with the SUL</param>
        /// <returns>null if equal, a counterexample if not which distinguish the SUL and conjecture</returns>
        Word EquivalenceQuery(DFA conjucture);

        /// <summary>
        /// Input Alphabet of the DFA
        /// </summary>
        Alphabet inputAlphabet
        {
            get;
        }
    }
}
